An Efficient Multi-Secret Image Sharing System Based on Chinese Remainder Theorem and Its FPGA Realization

نویسندگان

چکیده

Multi-Secret Image Sharing (MSIS) is important in information security when multiple images are shared an unintelligible form to different participants, where the can only be recovered using shares from participants. This paper proposes a simple and efficient ( $n,n$ )-MSIS system for colored based on XOR Chinese Remainder Theorem (CRT), all notation="LaTeX">$n$ share required recovery. The improves by adding dependency input robust against differential attacks, several delay units. It works with even odd number of inputs, has long sensitive key design CRT. Security analysis comparison related literature introduced good results including statistical tests, attack measures, sensitivity tests as well performance such time space complexity. In addition, Field Programmable Gate Array (FPGA) realization proposed presented throughput 530 Mbits/sec. Finally, MSIS validated through software hardware analyses proper resources low power consumption, high level security.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compartmented Secret Sharing Based on the Chinese Remainder Theorem

A secret sharing scheme starts with a secret and then derives from it certain shares (or shadows) which are distributed to users. The secret may be recovered only by certain predetermined groups. In case of compartmented secret sharing, the set of users is partitioned into compartments and the secret can be recovered only if the number of participants from any compartment is greater than a fixe...

متن کامل

Weighted Secret Sharing Based on the Chinese Remainder Theorem

In a ) , ( n t secret sharing scheme (SS), a dealer divides a secret into n shares in such a way that (a) the secret can be recovered successfully with t or more than t shares, and (b) the secret cannot be recovered with fewer than t shares. In a weighted secret sharing scheme (WSS), each share of a shareholder has a positive weight. The secret can be recovered if the overall weight of shares i...

متن کامل

Weighted Threshold Secret Sharing Based on the Chinese Remainder Theorem

A secret sharing scheme derives from a given secret certain shares (or shadows) which are distributed to users. The secret can be recovered only by certain predetermined groups. In the first secret sharing schemes only the number of the participants in the reconstruction phase was important for recovering the secret. Such schemes have been referred to as threshold secret sharing schemes. In the...

متن کامل

General Secret Sharing Based on the Chinese Remainder Theorem

In this paper we extend the threshold secret sharing schemes based on the Chinese remainder theorem in order to deal with more general access structures. Aspects like verifiability, secret sharing homomorphisms and multiplicative properties are also discussed. AMS Subject Classification: 94A62, 11A07

متن کامل

Secret Sharing Extensions based on the Chinese Remainder Theorem

In this paper, we investigate how to achieve verifiable secret sharing (VSS) schemes by using the Chinese Remainder Theorem (CRT). We first show that two schemes proposed earlier are not secure from an attack where the dealer is able to distribute inconsistent shares to the users. Then we propose a new VSS scheme based on the CRT and prove its security. Using the proposed VSS scheme, we develop...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3240202